Polling systems with a gated/exhaustive discipline

نویسندگان

  • Onno J. Boxma
  • A. C. C. van Wijk
  • Ivo J. B. F. Adan
چکیده

We consider a polling system where the server cyclically serves the queues according to the following discipline: the server does one round of visits to the queues applying the gated service discipline at each of the queues, followed by one round of visits applying the exhaustive service discipline at each of the queues, and this alternating pattern repeats itself. We call this the Gated/Exhaustive service discipline. For this we derive (i) a Pseudo Conservation Law for the weighted sum of the mean waiting times, (ii) the mean steady state waiting times using Mean Value Analysis, (iii) queue length distributions making use of results for Multitype Branching Processes and the concept of so-called Smart Customers, and (iv) the sojourn time distributions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mixed gated/exhaustive service in a polling model with priorities

In this paper we consider a single-server polling system with switch-over times. We introduce a new service discipline, mixed gated/exhaustive service, that can be used for queues with two types of customers: high and low priority customers. At the beginning of a visit of the server to such a queue, a gate is set behind all customers. High priority customers receive priority in the sense that t...

متن کامل

Expected Delay Analysis of Polling Systems in Heavy Traffic

We study the expected delay in a cyclic polling model with mixtures of exhaustive and gated service in heavy traffic. We obtain closed-form expressions for the mean delay under standard heavy-traffic scalings, providing new insights into the behaviour of polling systems in heavy traffic. The results lead to excellent approximations of the expected waiting times in practical heavy-load scenarios...

متن کامل

Scheduling in polling systems

We present a simple mean value analysis (MVA) framework for analyzing the effect of scheduling within queues in classical asymmetric polling systems with gated or exhaustive service. Scheduling in polling systems finds many applications in computer and communication systems. Our framework leads not only to unification but also to extension of the literature studying scheduling in polling system...

متن کامل

Queue Length Performance of Some Non-exhaustive Polling Models with Bernoulli Feedback

We study the queue length performance in non-exhaustive asymmetric polling systems with Bernoulli feedback. We obtain the PGF (Probability Generating Functions) and the mean values of the queue lengths, For the gated polling model, we define two new service policies: departure-gated policy and service-gated policy, and we demonstrate their difference in queueing performance. In an asymmetric sy...

متن کامل

Dynamic Routing in Polling Systems

Polling systems have important applications to Telecommunication Systems, Data Link Protocols, Local Area Computer Networks, Flexible Manufacturing Systems, etc. As such they have been the subject of extensive research in recent years, most notably in the context of cyclic queues. The focus of much of this research has been on evaluating performance measures of fixed-template routing schemes wi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008